import _00GraphFuc as gf
import _000GraphBasicProblem as gb

#在骑士周游图里面求欧拉图和哈密顿通路
n=5
[V,E]=gb.Knighttouregraph(n)
v0=0
Ec=gb.Eulercircuit(E,v0)
paths=gb.Hamiltonpath(V,E,v0)
print(V,E)
print("欧拉圈",Ec)
print("哈密顿通路",len(paths))